An Overview of Synchronous Message-Passing and Topology
نویسندگان
چکیده
منابع مشابه
An Overview of Synchronous Message-Passing and Topology
A slowly-growing number of computer scientists have found that ideas from topology can be used to analyze and understand problems in distributed computing. In this paper, we review one approach we have used in the past to write a succinct proof of the lower bound for the number of rounds needed to solve the k-set agreement problem in a synchronous, message-passing model of computation. The cent...
متن کاملSynchronous Message Passing
This paper studies the characteristics of synchronous ordering of messages. Synchronous ordering of messages deenes synchronous communication based on the causality relation rather than time. We present the necessary characteristics of any algorithm providing deadlock-free synchronous ordering of the messages. We also present the suucient conditions, based on the causality relations, for any al...
متن کاملAn Overview of Message Passing Environments
A majority of the MPP systems designed to date have been MIMD distributed memory systems. For almost all of these systems, message passing environments have provided the primary mechanism for programming multiprocessor applications. In this paper we provide an introduction to MPP systems in general. We then introduce current MPP message passing interfaces, by tracing their historical developmen...
متن کاملSynchronous Message Passing and Semaphores: An Equivalence Proof
A natural encoding of synchronous message exchange with direct wait-control is proved to be equivalent in a distributed environment to a refinement which uses semaphores to implement wait control. The proof uses a most general scheduler, which is left as abstract and assumed to satisfy a few realistic, explicitly stated assumptions. We hope to provide a scheme that can be implemented by current...
متن کاملFault-tolerant Agreement in Synchronous Message-passing Systems
This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed (computing) systems. Timed systems are systems in which desirable correctness or performance properties of the system depend on the timing of events, not just on the order of their occurrence. Timed systems are employed in a wide range o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2000
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)01148-5